A Memory-based Ant Colony Algorithm for the Bipartite Subgraph Problem

نویسندگان

  • Rong-Long Wang
  • Li-Qing Zhao
چکیده

An innovative ant colony algorithm called memory-based ant colony algorithm is proposed to solve the bipartite subgraph problem. In the proposed algorithm, artificial ant has memory of solution found previously, and can use it to construct a new solution. Besides, in the proposed algorithm two kinds of pheromone and two kinds of heuristic information are also adopted to reinforce the search ability. The proposed algorithm is tested on a large number of instances and compared with other algorithms. The experimental results show that the proposed algorithm is superior to its competitors.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

New Ant Colony Algorithm Method based on Mutation for FPGA Placement Problem

Many real world problems can be modelled as an optimization problem. Evolutionary algorithms are used to solve these problems. Ant colony algorithm is a class of evolutionary algorithms that have been inspired of some specific ants looking for food in the nature. These ants leave trail pheromone on the ground to mark good ways that can be followed by other members of the group. Ant colony optim...

متن کامل

ACO-Based Neighborhoods for Fixed-charge Capacitated Multi-commodity Network Design Problem

The fixed-charge Capacitated Multi-commodity Network Design (CMND) is a well-known problem of both practical and theoretical significance. Network design models represent a wide variety of planning and operation management issues in transportation telecommunication, logistics, production and distribution. In this paper, Ant Colony Optimization (ACO) based neighborhoods are proposed for CMND pro...

متن کامل

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

متن کامل

Ant Colony Algorithm for the Single Loop Routing Problem

In this paper, a new algorithm for solving the single loop routing problem is presented. The purpose of the single loop routing problem(SLRP) is to find the shortest loop for an automated guided vehicle covering at least one edge of each department of a block layout. First it shown that this problem can be represented as a graph model. Then a meta-heuristic algorithm based on and colony system ...

متن کامل

A Non-dominated Sorting Ant Colony Optimization Algorithm Approach to the Bi-objective Multi-vehicle Allocation of Customers to Distribution Centers

Distribution centers (DCs) play important role in maintaining the uninterrupted flow of goods and materials between the manufacturers and their customers.This paper proposes a mathematical model as the bi-objective capacitated multi-vehicle allocation of customers to distribution centers. An evolutionary algorithm named non-dominated sorting ant colony optimization (NSACO) is used as the optimi...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010